On the Number of Colored Birch and Tverberg Partitions
نویسنده
چکیده
In 2009, Blagojević, Matschke & Ziegler established the first tight colored Tverberg theorem. We develop a colored version of our previous results (2008): Evenness and non-trivial lower bounds for the number of colored Tverberg partitions. Both properties follow from similar results on the number of colored Birch partitions.
منابع مشابه
On the Number of Birch Partitions
Birch and Tverberg partitions are closely related concepts from discrete geometry. We show two properties for the number of Birch partitions: Evenness, and a lower bound. This implies the first non-trivial lower bound for the number of Tverberg partitions that holds for arbitrary q, where q is the number of partition blocks. The proofs are based on direct arguments, and do not use the equivaria...
متن کامل3N colored points in a plane
More than 50 years ago, the Cambridge undergraduate Bryan Birch showed that “3N points in a plane” can be split into N triples that span triangles with a non-empty intersection. He also conjectured a sharp, higher-dimensional version of this, which was proved by Helge Tverberg in 1964 (freezing, in a hotel room in Manchester). In a 1988 Computational Geometry paper, Bárány, Füredi & Lovász note...
متن کاملClassifying unavoidable Tverberg partitions
Let T (d, r) def = (r − 1)(d + 1) + 1 be the parameter in Tverberg’s theorem. We say that a partition I of {1, 2, . . . , T (d, r)} into r parts occurs in an ordered point sequence P if P contains a subsequence P ′ of T (d, r) points such that the partition of P ′ that is order-isomorphic to I is a Tverberg partition. We say that I is unavoidable if it occurs in every sufficiently long point se...
متن کاملOn the number of Tverberg partitions in the prime power case
We give an extension of the lower bound of [VŽ93] for the number of Tverberg partitions from the prime to the prime power case. Our proof is inspired by the Zp–index version of the proof in [Mat03] and uses Volovikov’s Lemma. Analogously, one obtains an extension of the lower bound for the number of different splittings of a generic necklace to the prime power case.
متن کاملOptimal bounds for the colored Tverberg problem
We prove a “Tverberg type” multiple intersection theorem. It strengthens the prime case of the original Tverberg theorem from 1966, as well as the topological Tverberg theorem of Bárány et al. (1980), by adding color constraints. It also provides an improved bound for the (topological) colored Tverberg problem of Bárány & Larman (1992) that is tight in the prime case and asymptotically optimal ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 21 شماره
صفحات -
تاریخ انتشار 2014